print("I am myoudle.py,let's dance!")
def fibo(n):
    """使用递归函数计算斐波那契数列"""
    if n <= 0:
        return []
    elif n == 1:
        return [0]
    elif n == 2:
        return [0, 1]
    else:
        list_fibo = fibo(n - 1)
        list_fibo.append(list_fibo[-1] + list_fibo[-2])
        return list_fibo

# 获取用户输入的数字
num = int(input("请输入要计算的斐波那契数列的长度："))

# 计算斐波那契数列
fibo_list = fibo(num)

print("斐波那契数列：", fibo_list)
